Exactly Solve Integer Linear Systems Using Numerical Methods
نویسنده
چکیده
We present a new fast way to exactly solve non-singular linear systems with integer coefficients using numerical methods. This leads to high performace in practice and also leads to asymptoticly fast algorithms for some special family of linear systems. Our method is to find an initial approximate solution by using a fast numerical method, then amplify the approximate solution by a scalar, adjust the amplified solution and corresponding residual so that they can be stored exactly, and repeat these steps to refine the solution until high enough accuracy is achieved, and finally reconstruct the rational solution. We will expose the theoretical cost and show some experimental results.
منابع مشابه
Modeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملNew concepts on the fuzzy linear systems and an application
As we know, developing mathematical models and numerical procedures that would appropriately treat and solve systems of linear equations where some of the system's parameters are proposed as fuzzy numbers is very important in fuzzy set theory. For this reason, many researchers have used various numerical methods to solve fuzzy linear systems. In this paper, we define the concepts of midpoint a...
متن کاملMax-plus-algebraic Problems and the Extended Linear Complementarity Problem - Algorithmic Aspects
Many fundamental problems in the max-plus-algebraic system theory for discrete event systems — among which the minimal state space realization problem — can be solved using an Extended Linear Complementarity Problem (ELCP). We present some new, more efficient methods to solve the ELCP. We show that an ELCP with a bounded feasible set can be recast as a standard Linear Complementarity Problem (L...
متن کاملTechnical report bds : 01 - 15 Max - plus - algebraic problems and the extended linear complementarity problem – Algorithmic aspects ∗
Many fundamental problems in the max-plus-algebraic system theory for discrete event systems — among which the minimal state space realization problem — can be solved using an Extended Linear Complementarity Problem (ELCP). We present some new, more efficient methods to solve the ELCP. We show that an ELCP with a bounded feasible set can be recast as a standard Linear Complementarity Problem (L...
متن کاملStability and numerical solution of time variant linear systems with delay in both the state and control
In this paper, stability for uncertain time variant linear systems with time delay is studied. A new sufficient condition for delay-dependent systems is given in matrix inequality form which depends on the range of delay. Then, we introduce a new direct computational method to solve delay systems. This method consists of reducing the delay problem to a set of algebraic equations by first expand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005